import java.util.*;

public class Main {

    public static void main(String[] args) {
        HashMap<String,Integer> map = new HashMap<>();

        Integer a = 1;
        int b=2;
        int c = b-a;
        System.out.println(c < a);
    }
    public static void main2(String[] args){
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int[] arr1 = new int[n];

        for(int i=0; i<n; i++){
            arr1[i] = in.nextInt();
        }

        int m = in.nextInt();
        int[] arr2 = new int[m];

        for(int i=0; i<m; i++){
            arr2[i] = in.nextInt();
        }

        int i = 0;
        int j = 0;
        int k = 0;
        int[] arr = new int[n+m];

        while(j < n && k < m){
            if(arr1[j] < arr2[k]){
                arr[i++] = arr1[j++];
            }else{
                arr[i++] = arr2[k++];
            }
        }

        while(j < n){
            arr[i++] = arr1[j++];
        }

        while(k < m){
            arr[i++] = arr2[k++];
        }

        for(int s=0; s<m+n; s++){
            System.out.print(arr[s]);
            if(s < m+n-1){
                System.out.print(" ");
            }
        }
    }
    public static void main1(String arg[]) {
        Scanner snc =new Scanner(System.in);
        int n =snc.nextInt();

        int arr[]=new int[n];
        for(int i=0;i<n;i++){
            arr[i]=snc.nextInt();
        }
        Main main=new Main();
        System.out.println(main.hIndex(arr));
    }

    public int hIndex(int[] citations) {
        if(citations.length == 1 && citations[0] == 0){
            return 0;
        }
        int h = 0;
        int len = citations.length;
        int count = 0;

        while (true){
            count = 0;
            for(int i=0; i<len; i++){
                if(citations[i] >= h){
                    count++;
                }
            }

            if(h < count){
                h++;
            }else if(h == count){
                break;
            }else{
                h--;
                break;
            }
        }

        return h;
    }

}